Novel Digital Signature Schemes based on Factoring and Discrete Logarithms
نویسندگان
چکیده
In the paper, we propose a new digital signature scheme based on factoring and discrete logarithms. Specially, we prove that the security of the proposed signature scheme is based on both the security of the ElGamal signature scheme and the security of the modified OSS signature scheme. This is the first scheme which can be proved that its security is based on two hard problems. Like Meta-ElGamal signature schemes, the proposed signature scheme can be extended to many kinds of scheme. The corresponding computations for our proposed scheme are also discussed.
منابع مشابه
Meta-He digital signatures based on factoring and discrete logarithms
This study investigates all variations of the He’s digital signature scheme based on factoring and discrete logarithms. In contrast to three modular exponentiation computation, the optimal two schemes of generalized He’s signature verification reveals that only two modular exponentiation is needed for signature verification. Key-Words: Digital signature, Batch verify, Computation complexity.
متن کاملNew ID-Based Digital Signature Scheme on Factoring and Discrete Logarithms
The past years have seen many attempts to construct identity based signature schemes on a single hard problem, like factoring or discrete logarithms. But in the near future, those systems will no longer be secure if the solution of factoring or discrete logarithms problems is discovered. In this paper, we propose a new identification based signature scheme on factoring (FAC) problem and discret...
متن کاملA new digital signature scheme based on factoring and discrete logarithms
Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes a...
متن کاملA New Design Partially Blind Signature Scheme Based on Two Hard Mathematical Problems
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on fact...
متن کاملOn Cryptographic Schemes Based on Discrete Logarithms and Factoring
At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N . We so obtain compact representations for cryptographic systems that base their security on the discrete logarithm problem and the factoring problem. This results in smaller key sizes and substantial savings in memory and bandwidt...
متن کامل